#include <bits/stdc++.h>
#define fi first
#define se second
using ll = long long;
using namespace std;
const int N = 1e5 + 10;
int a[N];
set<int> s;
void solve()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++)
    {
        s.clear();
        for (int j = 1; j <= i; j++)
        {
            s.insert(a[j]);
        }
        cout << i - s.size() << " ";
    }
}
int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios::sync_with_stdio(false);
    int T = 1;
    // cin>>T;
    while (T--)
    {
        solve();
    }
    return 0;
}